Factoring multivariate integral polynomials
نویسندگان
چکیده
منابع مشابه
Factoring multivariate polynomials via partial differential equations
A new method is presented for factorization of bivariate polynomials over any field of characteristic zero or of relatively large characteristic. It is based on a simple partial differential equation that gives a system of linear equations. Like Berlekamp’s and Niederreiter’s algorithms for factoring univariate polynomials, the dimension of the solution space of the linear system is equal to th...
متن کاملFactoring Multivariate Polynomials over Finite Fields
We consider the deterministic complexity of the problem of polynomial factorization over finite fields given a finite field Fq and a polynomial h(x, y) ∈ Fq[x, y] compute the unique factorization of h(x, y) as a product of irreducible polynomials. This problem admits a randomized polynomial-time algorithm and no deterministic polynomial-time algorithm is known. In this chapter, we give a determ...
متن کاملFactoring Multivariate Polynomials over Large Finite Fields
A simple probabilistic algorithm is presented to find the irreducible factors of a bivariate polynomial over a large finite field. For a polynomial f(x, y) over F of total degree n , our algorithm takes at most 4.89, 2 , n log n log q operations in F to factor f(x , y) completely. This improves a probabilistic factorization algorithm of von zur Gathen and Kaltofen, which takes 0(n log n log q) ...
متن کاملFactoring Multivariate Polynomials over Algebraic Number Fields
The algorithm for factoring polynomials over the integers by Wang and Rothschild is generalized to an algorithm for the irreducible factorization of multivariate polynomials over any given algebraic number field. The extended method makes use of recent ideas in factoring univariate polynomials over large finite fields due to Berlekamp and Zassenhaus. The procedure described has been implemented...
متن کاملFactoring Multivariate Polynomials over Algebraic Number Fields
The algorithm for factoring polynomials over the integers by Wang and Rothschild is generalized to an algorithm for the irreducible factorization of multivariate polynomials over any given algebraic number field. The extended method makes use of recent ideas in factoring univariate polynomials over large finite fields due to Berlekamp and Zassenhaus. The procedure described has been implemented...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1984
ISSN: 0304-3975
DOI: 10.1016/0304-3975(84)90117-8